Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach

نویسندگان

  • Itay Gurvich
  • James R. Luedtke
  • Tolga Tezcan
چکیده

W consider the problem of staffing call centers with multiple customer classes and agent types operating under quality-of-service (QoS) constraints and demand rate uncertainty. We introduce a formulation of the staffing problem that requires that the QoS constraints are met with high probability with respect to the uncertainty in the demand rate. We contrast this chance-constrained formulation with the average-performance constraints that have been used so far in the literature. We then propose a two-step solution for the staffing problem under chance constraints. In the first step, we introduce a random static planning problem (RSPP) and discuss how it can be solved using two different methods. The RSPP provides us with a first-order (or fluid) approximation for the true optimal staffing levels and a staffing frontier. In the second step, we solve a finite number of staffing problems with known arrival rates—the arrival rates on the optimal staffing frontier. Hence, our formulation and solution approach has the important property that it translates the problem with uncertain demand rates to one with known arrival rates. The output of our procedure is a solution that is feasible with respect to the chance constraint and nearly optimal for large call centers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A joint chance-constrained programming approach for call center workforce scheduling under uncertain call arrival forecasts

We consider a workforce management problem arising in call centers, namely the shift-scheduling problem. It consists in determining the number of agents to be assigned to a set of predefined shifts so as to optimize the trade-off between manpower cost and customer quality of service. We focus on explicitly taking into account in the shift-scheduling problem the uncertainties in the future call ...

متن کامل

Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

متن کامل

A Comprehensive Mathematical Model for a Location-routing-inventory Problem under Uncertain Demand: a Numerical Illustration in Cash-in-transit Sector

The purpose of this article is to model and solve an integrated location, routing and inventory problem (LRIP) in cash-in-transit (CIT) sector. In real operation of cash transportation, to decrease total cost and to reduce risk of robbery of such high-value commodity. There must be substantial variation, making problem difficult to formulate. In this paper, to better fit real life applications ...

متن کامل

A chance-constrained multi-objective model for final assembly scheduling in ATO systems with uncertain sub-assembly availability

A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...

متن کامل

Shift-scheduling of Call Centers with Uncertain Arrival Parameters

This paper considers a multi-periodic multi-shift call center staffing problem with two types of jobs: calls and emails. The arrival rate of calls is random and the workforce presents some flexibility: the agents can be affected to one job type in real-time. At each period of the day, a service quality constraint limits the waiting time for a call. The staffing problem is modeled as a newsboy-t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Management Science

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2010